Undecidability of linear inequalities in graph homomorphism densities
نویسندگان
چکیده
منابع مشابه
Undecidability of Linear Inequalities in Graph Homomorphism Densities
Many fundamental theorems in extremal graph theory can be expressed as algebraic inequalities between subgraph densities. As is explained below, for dense graphs, it is possible to replace subgraph densities with homomorphism densities. An easy observation shows that one can convert any algebraic inequality between homomorphism densities to a linear inequality. Inspired by the work of Freedman,...
متن کاملExact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
متن کاملDual graph homomorphism functions
For any two graphs F and G, let hom(F,G) denote the number of homomorphisms F → G, that is, adjacency preserving maps V (F ) → V (G) (graphs may have loops but no multiple edges). We characterize Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary. Email: [email protected]. Research sponsored by OTKA Grant No. 67867. CWI and University of Amsterdam, Amsterdam, The Netherlands....
متن کاملGraph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whethera graph G matches another Gp, i.e., whether G has a topologicalstructure similar to that of Gp. The traditional notions of graphhomomorphism and isomorphism often fall short of capturing thestructural similarity in these applications. This paper studies revisions of these notions, providing a full treatment from co...
متن کاملFractal property of the graph homomorphism order
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this “fractal” property contributes to the spectacular properties of the homomorphism order. We first show the fractal property by using Sparse Incomparability Lemma and then by a more involved elementary argument.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 2011
ISSN: 0894-0347
DOI: 10.1090/s0894-0347-2010-00687-x